On a Family of Diamond-Free Strongly Regular Graphs
نویسندگان
چکیده
The existence of a partial quadrangle PQ(s, t, μ) is equivalent to the existence of a diamond-free strongly regular graph SRG(1+s(t+1)+s2t(t+1)/μ, s(t+1), s−1, μ). Let S be a PQ(3, (n + 3)(n2 − 1)/3, n2 + n) such that for every two non-collinear points p1 and p2, there is a point q non-collinear with p1, p2, and all points collinear with both p1 and p2. In this article, we establish that S exists only for n ∈ {−2, 2, 3} and probably n = 10.
منابع مشابه
CERTAIN TYPES OF EDGE m-POLAR FUZZY GRAPHS
In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...
متن کاملComputer algebra investigation of known primitive triangle-free strongly regular graphs
With the aid of computer algebra systems COCO and GAP with its packages we are investigating all seven known primitive triangle-free strongly regular graphs on 5, 10, 16, 50, 56, 77 and 100 vertices. These graphs are rank 3 graphs, having a rich automorphism group. The embeddings of each graph from this family to other ones are described, the automorphic equitable partitions are classified, all...
متن کاملOn cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کاملStrongly regular edge-transitive graphs
In this paper, we examine the structure of vertexand edge-transitive strongly regular graphs, using normal quotient reduction. We show that the irreducible graphs in this family have quasiprimitive automorphism groups, and prove (using the Classification of Finite Simple Groups) that no graph in this family has a holomorphic simple automorphism group. We also find some constraints on the parame...
متن کاملJ ul 2 00 9 1 STRONGLY REGULAR EDGE - TRANSITIVE GRAPHS
In this paper, we examine the structure of vertexand edge-transitive strongly regular graphs, using normal quotient reduction. We show that the irreducible graphs in this family have quasiprimitive automorphism groups, and prove (using the Classification of Finite Simple Groups) that no graph in this family has a holomorphic simple automorphism group. We also find some constraints on the parame...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 28 شماره
صفحات -
تاریخ انتشار 2014